relev rank kernel paper concern relev rank search term depend inform propos unifi approach relev rank kernel techniqu statist learn approach gener rank model defin kernel function queri document represent number kernel function propos specif rank model paper includ bm kernel lmir kernel kl diverg kernel approach advantag gener model effect repres type term depend inform achiev high perform model strong connect exist model bm lmir solid theoret background model effici comput experiment result web search dataset trec dataset show propos kernel approach outperform mrf baselin method relev rank click measur recommend relev empir user studi context dawar rank web search context search queri search engin meaning hint answer current queri previou studi context awar search focus develop context model limit small scale investig control laboratori set context awar rank web search critic problem larg remain unsolv advantag type context rank integr context inform rank model paper tackl essenti problem analyt empir develop rank principl type context adopt learn rank approach integr rank principl state art rank model encod context inform featur model empir test approach larg search log data set obtain major commerci search engin evalu human judgment implicit user click data experiment result show context awar rank approach improv rank commerci search engin ignor context inform method outperform baselin method consid context inform rank search brows log mine web inform retriev challeng search system improv qualiti train data learn rank click dthrough data inform retriev relev document respect queri judg human evalu learn rank function previou work shown level nois relev judgment effect evalu comparison purpos recent learn rank major mean creat rank model model automat learn data deriv larg number relev judgment previou work qualiti train data learn rank paper studi issu specif address problem firstli show qualiti train data label human critic impact perform learn rank algorithm propos detect relev judgment error click data accumul search engin discrimin model refer sequenti depend model full depend model propos make detect model condit depend relev label power condition independ model previous propos task final verifi train data error detect correct method improv perform learn rank algorithm web search fbrows log mine challeng method applic understand section queri document match understand user inform framework comput page import base user behavior introduct special issu learn rank inform retriev gener approxim framework direct optim inform retriev measur prefac part seri studi support california governor advisori committe educ excel prefac list figur iv gener markov framework page import comput propos gener markov framework comput page import framework markov skeleton process model random walk conduct web surfer graph page import defin product page reachabl page util comput transit probabl stai time page markov skeleton process show gener framework cover exist algorithm special case framework defin algorithm handl complex problem demonstr framework exploit process name mirror semi markov process experiment result valid mirror semi markov process model effect previou model task applic ip multicast technolog comput laboratori teach system implement strategi global oltp base od heterogen environ web queri recommend sequenti queri predict abstract web queri recommend long consid kei featur search engin build good web queri recommend system difficult due fundament challeng predict user search intent limit user context inform paper propos sequenti queri predict approach grasp user search intent base past queri sequenc resembl histor queri sequenc model mine massiv search engin log queri sequenc model examin includ naiv variablelength gram model variabl memori markov vmm model propos mixtur variabl memori markov mvmm model extens experi conduct benchmark sequenc predict algorithm convent pairwis approach larg scale search log extract commerci search engin result show sequenc wise approach significantli outperform convent pair wise term predict accuraci mvmm approach consist lead pack make effect practic approach web queri recommend gener analysi listwis learn dto drank algorithm paper present theoret framework rank demonstr perform gener analysi listwis rank algorithm framework learn rank algorithm propos recent year listwis approach shown higher empir rank perform compar approach theoret studi listwis approach paper propos theoret framework rank natur describ listwis learningto rank algorithm framework prove theorem gener bound listwis rank algorithm basi rademach averag class compound function compound function listwis loss function outer function rank model function comput rademach averag exist listwis algorithm listml listnet rankcosin discuss tight bound situat regard list length transform function name entiti mine click dthrough data weakli supervis latent dirichlet alloc paper address name entiti mine nem mine knowledg name entiti movi game book huge amount data nem potenti applic includ web search onlin advertis recommend system challeng task find suitabl data sourc cope ambigu name entiti class incorpor human supervis mine process paper propos conduct nem click data collect web search engin emploi topic model gener click data learn topic model weak supervis human specif character name entiti queri url click data topic model resolv ambigu name entiti class repres class topic emploi method refer weakli supervis latent dirichlet alloc ws lda accur learn topic model partial label name entiti experi larg scale click data billion queri url pair show propos approach conduct accur nem significantli outperform baselin distribut hierarch fault manag paradigm satellit network name entiti recognit queri present simpl scalabl algorithm cluster ten million phrase result cluster featur discrimin classifi demonstr power gener approach appli method applic name entiti recognit queri classif result show phrase cluster offer signific improv word cluster ner system achiev current result wide conll benchmark queri classifi par system kddcup resort labor intens knowledg engin effort rank approach keyphras extract paper address issu automat extract keyphras document previous problem formal classif learn method classif util paper point essenti cast problem rank emploi learn rank method perform task specif emploi rank svm state art method learn rank keyphras extract experiment result dataset show rank svm significantli outperform baselin method svm naiv bay indic exploit learn rank techniqu keyphras extract adapt octre textur paint algorithm context dawar search learn larg variabl length hidden markov model search log captur context user queri previou queri click session understand user inform context awar approach document rank queri suggest url recommend improv user search experi substanti paper propos gener approach context awar search captur context queri learn variabl length hidden markov model vlhmm search session extract log data mathemat model intuit learn larg vlhmm million state hundr million search session pose grand challeng develop strategi paramet initi vlhmm learn greatli reduc number paramet estim practic devis method distribut vlhmm learn map reduc model test approach real data set consist billion queri billion click million search session evalu effect vlhmm learn real data search applic document rank queri suggest url recommend experiment result show approach effect effici semi dsupervis document retriev editori special issu select paper pakdd learn rank inform retriev lr ir inform retriev technolog retriev inform web common practic internet user mine rank acronym pattern mine rank acronym pattern construct safe web servic base wse construct safe web servic base wse express busi rule bpmn htm topic model hypertext previous topic model plsi probabilist latent semant index lda latent dirichlet alloc develop model content plain text recent topic model process hypertext web page propos propos hypertext model gener model give rise word hyperlink paper point repres content hypertext essenti assum hyperlink fix defin topic model gener word paper propos topic model hypertext process refer hypertext topic model htm htm defin distribut word document content document mixtur latent topic document latent topic document document cite topic character distribut word convent topic model paper propos method learn htm model experiment result show htm outperform baselin topic discoveri document classif dataset express busi rule bpmn kinemat analysi drpr parallel mechan mill big radiu spheric fiduci surfac listwis approach learn rank theori algorithm paper aim conduct studi listwis approach learn rank listwis approach learn rank function take individu list instanc minim loss function defin predict list ground truth list exist work approach focus develop algorithm method rankcosin listnet propos good perform observ underli theori suffici studi amend problem paper propos conduct theoret analysi learn rank algorithm investig properti loss function includ consist sound continu differenti convex effici suffici condit consist rank result obtain relat research paper conduct analysi loss function likelihood loss cosin loss cross entropi loss rankcosin listnet likelihood loss lead develop queri dlevel stabil gener learn rank paper concern gener abil learn rank algorithm inform retriev ir point kei address learn problem viewpoint queri defin number concept includ queri level loss queri level risk querylevel stabil analyz gener abil learn rank algorithm give queri level gener bound queri level stabil tool analysi help deriv advanc algorithm ir appli propos theori exist algorithm rank svm irsvm experiment result algorithm verifi correct theoret analysi perform genet algorithm dynam optim problem context dawar queri suggest mine click dthrough session data semant web extens world wide web enabl peopl share content boundari applic websit current search engin plai import central role current web infrastructur document rank algorithm core search engin similarli global rank continu condit random field paper studi global rank problem learn rank method convent learn rank method design local rank sens rank model defin singl object document inform retriev applic loos approxim relat exist object defin rank model function object rank relat includ paper refer problem global rank propos emploi continu condit random field crf conduct learn task continu crf model defin condit probabl distribut rank score object condit object natur repres content inform object relat inform object global rank take specif inform retriev task exampl paper show continu crf method perform global rank baselin directli optim evalu measur learn rank central issu learn rank inform retriev develop algorithm construct rank model directli optim evalu measur inform retriev averag precis map normal discount cumul gain ndcg algorithm includ svm map adarank propos effect verifi relationship algorithm clear comparison conduct paper conduct studi approach directli optim evalu measur learn rank inform retriev ir focu method minim loss function upper bound basic loss function defin ir measur provid gener framework studi analyz exist algorithm svm map adarank framework framework base upper bound analysi type upper bound discuss show deriv algorithm basi analysi creat algorithm call permurank conduct comparison svm map adarank permurank convent method rank svm rank boost benchmark dataset experiment result show method base direct optim evalu measur outperform convent method rank svm rankboost signific differ exist perform direct optim method unifi discrimin model queri refin paper address issu queri refin involv reformul ill form search queri order enhanc relev search result queri refin typic includ number task spell error correct word split word merg phrase segment word stem acronym expans previou research task address separ emploi gener model paper propos emploi unifi discrimin model queri refin specif propos condit random field crf model suitabl problem refer condit random field queri refin crf qr sequenc queri word crf qr predict sequenc refin queri word refin oper sens crf qr differ greatli convent crf model type crf qr model basic model extend model introduc merit emploi crf qr refin task perform simultan accuraci refin enhanc advantag discrimin model gener model fulli leverag experiment result demonstr crf qr significantli outperform baselin method crf qr web search signific improv relev obtain browserank let web user vote page import rank refin applic inform retriev problem rank refin improv accuraci exist rank function small set label instanc interest learn rank function complementari sourc inform rank inform exist rank function base ranker obtain user feedback problem import inform retriev feedback gradual collect kei challeng combin sourc inform aris fact rank inform present base ranker imperfect rank inform obtain user feedback noisi present boost algorithm rank refin effect leverag sourc inform empir studi show propos algorithm effect rank refin significantli outperform baselin algorithm incorpor output base ranker addit featur learn rank relat object applic web search learn rank statist learn technolog creat rank model sort object technolog successfulli appli web search kei machineri build search engin exist approach learn rank case exist relationship object rank fact situat common practic web search queri relationship exist retriev document url hierarchi similar util inform rank document paper address issu formul learn problem refer learn rank relat object learn queri dlevel loss function inform retriev rapid develop inform retriev web search rank branch supervis learn exist machin learn technolog support vector machin boost neural network appli problem achiev success algorithm propos initi inform retriev loss function accord wide evalu criteria inform retriev criteria includ averag precis map precis fourth asian inform retriev symposium air advanc knowledg discoveri data mine unifi tag approach text normal search document base relev type abstract paper extend previou work document retriev document type classif address problem type search specif queri design document type search system retriev rank document base relev queri base likelihood design document type paper formal problem gener framework consist relev model type model relev model document relev queri type model document belong design document type method comb model linear combin score threshold type score hybrid previou method page search instruct document search exampl conduct seri experi experiment result show propos approach significantli outperform baselin method dstep pagerank web search learn rank pairwis approach listwis approach paper concern learn rank construct model function rank object learn rank document retriev collabor filter applic method learn rank propos object pair instanc learn refer pairwis approach paper pairwis approach offer advantag ignor fact rank predict task list object paper postul learn rank adopt listwis approach list object instanc learn paper propos probabilist method approach specif introduc probabl model refer permut probabl top probabl defin listwis loss function learn neural network gradient descent emploi model algorithm learn method experiment result inform retriev show propos listwis approach perform pairwis approach rank multipl hyperplan central problem applic inform retriev rank learn rank consid promis approach address issu rank svm state art method learn rank empir demonstr effect paper studi issu learn rank approach svm techniqu perform task point rank svm advantag shortcom rank svm emploi singl hyperplan featur space model rank simpl tackl complex rank problem train rank svm computation costli paper altern approach rank svm call multipl hyperplan ranker mhr make comparison approach mhr take divid conquer strategi emploi multipl hyperplan rank instanc final aggreg rank result hyperplan mhr rank svm special case mhr overcom shortcom rank svm suffer experiment result inform retriev dataset show mhr outperform rank svm rank adarank boost algorithm inform retriev paper address issu learn rank document retriev task model automat creat train data util rank document good model evalu perform measur map averag precis ndcg normal discount cumul gain ideal learn algorithm train rank model directli optim perform measur respect train data exist method train rank model minim loss function loos relat perform measur rank svm rankboost train rank model minim classif error instanc pair deal problem propos learn algorithm framework boost minim loss function directli defin perform measur algorithm refer adarank repeatedli construct weak ranker basi weight train data final linearli combin weak ranker make rank predict prove train process adarank enhanc perform measur experiment result benchmark dataset show adarank significantli outperform baselin method bm rank svm rankboost featur select rank rank import topic inform retriev algorithm learn rank model intens studi case featur select import realiti featur select method classif directli appli rank argu strike differ rank classif develop featur select method rank end propos featur select method paper specif featur rank train instanc defin rank accuraci term perform measur loss function import featur defin correl rank result featur similar base definit formul featur select issu optim problem find featur maximum total import score minimum total similar score demonstr solv optim problem effici test effect featur select method inform retriev dataset rank model experiment result show method outperform tradit featur select method rank task supervis rank aggreg paper concern rank aggreg task combin rank result individu ranker meta search previous rank aggreg perform mean unsupervis learn enhanc rank accuraci propos emploi supervis learn perform task label data refer approach supervis rank aggreg set gener framework conduct supervis rank aggreg learn formal optim minim disagr rank result label data case studi focu markov chain base rank aggreg paper optim markov chain base method convex optim problem hard solv prove transform optim problem semidefinit program solv effici experiment result meta search show supervis rank aggreg significantli outperform exist unsupervis method web page titl extract applic adapt document rank user prefer click dthrough data abstract paper propos approach rank document retriev search engin click data goal make final rank list document accur repres user prefer reflect click data approach combin rank result tradit ir algorithm bm machin learn algorithm na ve bay machin learn algorithm train clickthrough data queri document ir algorithm run document collect altern strategi combin result click data document data experiment result confirm method click data greatli improv prefer rank method bm found linear combin score na ve bay score bm perform task time found prefer rank method preserv relev rank prefer rank method perform bm relev rank supervis learn approach entiti search partement informatiqu de recherch op rationnel universit de montr al abstract paper address problem entiti search expert search time search exampl entiti search queri entiti type search system return rank list entiti type person time express relev queri rank kei issu entiti search literatur expert search studi cooccurr propos gener featur rank entiti search propos linear model combin featur emploi supervis learn approach train model experiment result data set method significantli outperform baselin method base sole occurr cost dsensit learn svm rank abstract paper propos method learn rank rank svm method perform task formul problem binari classif instanc pair perform classif mean support vector machin svm rank svm loss incorrect classif instanc pair rank pair defin note applic inform retriev neg effect make error higher rank lower rank larger make error lower rank natur bring idea cost sensit learn learn rank precis set loss misclassif instanc pair rank pair cost sensit loss function construct rank svm model basi loss function simul result show method work rank svm practic set rank experiment result method outperform exist method includ rank svm real inform retriev task document search definit search detect link spam tempor inform effect protect spam search rank result import issu contemporari web search engin paper address problem combat major type web spam link spam previou work anti link spam manag make snapshot web data detect spam advantag fact link spam result drastic link short time period overcom shortcom paper propos tempor inform link detect link spam inform specif defin tempor featur link growth rate igr link death rate idr spam classif model svm experiment result web domain graph data show link spam successfulli detect propos method mine latent associ object type mixtur model da case studi expert fexpertis mine text inform extract retriev abstract measur semant related applic natur languag process measur propos measur wordnet central resourc domain ontolog context propos evalu semant related measur owl domain ontolog conclud semant rank ontolog grammat relat structur procedur disambigu domain context repres ontolog queri languag natur languag express ontolog queri languag sparql construct queri autom depend semant related measur ontolog concept methodolog successfulli integr ontonl framework natur languag interfac gener knowledg repositori experiment show good perform number owl ontolog adapt rank svm document retriev paper concern appli learn rank document retriev rank svm typic method learn rank point factor appli rank svm gener learn rank method document retriev correctli rank document top result list crucial inform retriev system conduct train rank result accur number relev document vari queri queri avoid train model bias queri larg number relev document previous exist method includ rank svm appli document retriev factor consider show make modif convent rank svm document retriev specif modifi hing loss function rank svm deal problem emploi method conduct optim loss function gradient descent quadrat program experiment result show method refer rank svm ir outperform convent rank svm exist method document retriev dataset fast thermal simul runtim temperatur track manag automat extract titl gener document machin learn paper propos machin learn approach titl extract gener document gener document document belong number specif genr includ present book chapter technic paper brochur report letter previous method propos titl extract research paper clear conduct automat titl extract gener document case studi extract offic includ word powerpoint approach annot titl sampl document word powerpoint train data train machin learn model perform titl extract train model method uniqu util format inform font size featur model turn format inform lead accur extract gener document precis recal titl extract word precis recal titl extract powerpoint experi intranet data import find work includ train model domain appli domain surprisingli train model languag appli languag significantli improv search rank result document retriev extract titl supervis learn approach search definit approach intranet search base inform extract partit dbase approach fast dchip decap budget minim paper propos fast decoupl capacit decap alloc budget algorithm earli stage decap estim stage decap minim todai vlsi physic design method base sensit base conjug gradient cg approach adopt techniqu significantli improv effici optim process approach appli time domain merg adjoint network method fast sensit calcul effici search step scheme propos replac timeconsum line search phase convent conjug gradient method decap budget optim optim entir larg circuit partit circuit number smaller circuit optim separ exploit local ad decap experiment result show propos algorithm achiev speed fastest decap alloc method report similar budget qualiti power grid circuit million node optim method half hour latest linux workstat fast thermal simul architectur level dynam thermal manag power densiti increas exponenti runtim regul oper temperatur dynam thermal manag paper propos approach thermal analysi chip architectur level effici dynam thermal manag approach base observ power consumpt architectur level modul microprocessor run typic workload present strong natur period featur exploit fast spectrum analysi frequenc domain comput steadi state respons obtain transient temperatur due initi condit constant power input numer stabl moment match approach carri total transient respons addit simul result result fast thermal analysi algorithm lead speedup tradit integr base transient analysi small accuraci loss effici method termin reduct interconnect circuit delai variat paper propos method effici reduc termin number gener linear interconnect circuit larg number input output termin delai variat algorithm motiv fact vlsi interconnect circuit similar termin term time delai metric due close structur due mathemat approxim mesh finit differ finit element scheme extract process allow delai toler variat reduc similar termin small number repres termin termin reduct tradit model order reduct method achiev compact model improv simul effici method termmerg base moment circuit metric time delai emploi singular decomposit svd method determin optimum number cluster base low rank approxim mean cluster algorithm cluster moment termin cluster experiment result number real industri interconnect circuit demonstr effect propos method effici thermal simul run dtime temperatur track manag power densiti increas exponenti run time regul oper temperatur dynam thermal manag imper paper propos approach real time thermal estim chip level effici dynam thermal manag lieu thermal sensor erron longer delai approach base observ averag power consumpt architectur level modul microprocessor run typic workload determin trend temperatur variat featur exploit appli fast moment match techniqu frequenc domain obtain transient temperatur due initi condit constant power input pattern numer stabl moment match approach carri speed line temperatur track high accuraci low overhead result fast thermal analysi algorithm linear time complex run time set lead order magnitud speed tradit integr base transient analysi averag maximum error run typic benchmark compar accept simul tool fast decap alloc algorithm robust dchip power deliveri automat extract titl gener document machin learn paper propos machin learn approach titl extract gener document gener document document belong number specif genr includ present book chapter technic paper brochur report letter previous method propos titl extract research paper clear conduct automat titl extract gener document case studi extract offic includ word powerpoint approach annot titl sampl document word powerpoint train data train machin learn model perform titl extract train model method uniqu util format inform font size featur model turn format inform lead accur extract gener document precis recal titl extract word precis recal titl extract powerpoint experi intranet data import find work includ train model domain appli domain surprisingli train model languag appli languag significantli improv search rank result document retriev extract titl email data clean research appli statist analysi techniqu email classif purpos identifi spam messag approach highli effect examin incom email exclus provid detail inform individu user behavior analyz outgo messag user behavior ascertain contribut empir analysi select optimum collect behavior featur user email traffic enabl rapid detect abnorm email activ demonstr effect outgo email analysi applic detect worm propag titl extract bodi html document applic web page retriev paper concern automat extract titl bodi html document titl html document correctli defin titl field realiti html titl bogu desir conduct automat extract titl bodi html document issu investig previous paper supervis machin learn approach address problem propos specif html titl util format inform font size posit font weight featur titl extract method significantli outperform baselin method line largest font size titl improv score applic web page retriev trec web track data evalu propos method html document retriev extract titl experiment result extract titl titl field titl field extract titl help task name page find improv research expert search enterpris track trec octopu architectur attempt achiev reliabl os rank definit supervis learn method paper concern problem definit search specif term retriev definit excerpt term rank extract excerpt likelihood good definit contrast tradit approach gener singl combin definit simpli output retriev definit definit rank essenti task method perform definit rank propos paper formal problem classif ordin regress specif judg good definit emploi svm classif model rank svm ordin regress model rank definit candid likelihood good definit featur construct svm rank svm model defin enterpris search system base method develop put practic experiment result svm rank svm significantli outperform baselin method heurist rule emploi convent inform retriev method okapi true answer paragraph sentenc experiment result show svm rank svm model train domain adapt domain indic gener model definit rank construct word translat disambigu bilingu bootstrap paper propos method word translat disambigu machin learn techniqu call bilingu bootstrap bilingu bootstrap make learn small number classifi data larg number unclassifi data sourc target languag translat construct classifi languag parallel repeatedli boost perform classifi classifi data languag exchang languag inform classifi data experiment result word translat disambigu base bilingu bootstrap consist significantli outperform exist method base monolingu bootstrap hierarch model simul larg analog circuit word translat disambigu bilingu bootstrap paper propos method word translat disambigu machin learn techniqu call bilingu bootstrap bilingu bootstrap make learn small number classifi data larg number unclassifi data sourc target languag translat construct classifi languag parallel repeatedli boost perform classifi classifi data languag exchang languag inform classifi data experiment result word translat disambigu base bilingu bootstrap consist significantli outperform exist method base monolingu bootstrap uncertainti reduct collabor bootstrap measur algorithm paper propos uncertainti reduct machin learn method train bilingu bootstrap refer gener term collabor bootstrap text classif stochast keyword gener paper consid improv perform text classif summari text text learn summari accur classifi text question effect summari learn paper propos method address problem techniqu refer stochast keyword gener skg propos method skg model train text summari classif text map skg vector probabl valu correspond keyword text classif conduct map vector method appli email classif desk experiment result propos method base skg significantli outperform method bilingu web data mine rank translat topic analysi finit mixtur model address issu topic analysi determin text topic structur represent indic topic includ text topic chang text topic analysi consist main task topic identif text segment reflect topic topic analysi extrem varieti text process applic previou studi suifici address explor asymmetr cluster statist languag model gram model stochast model predict word predict word previou word condit word word sequenc word translat disambigu bilingu bootstrap paper propos method word translat disambigu machin learn techniqu call bilingu bootstrap bilingu bootstrap make learn small number classifi data larg number unclassifi data sourc target languag translat construct classifi languag parallel repeatedli boost perform classifi classifi data languag exchang languag inform classifi data experiment result word translat disambigu base bilingu bootstrap consist significantli outperform exist method base monolingu bootstrap base noun phrase translat web data em algorithm problem base noun phrase translat propos method perform task base np search translat candid web determin translat candid method develop method emploi ensembl na ve bayesian classifi construct em algorithm inth method tf idf vector construct em algorithm experiment result coverag accuraci method significantli baselin method reli exist technolog mine open answer questionnair data text classif esc dbase stochast decis list propos method text classif stochast decis list stochast decis list order sequenc rule method view rule base method text classif advantag readabl refin acquir knowledg method uniqu decis list automat construct basi principl minim extend stochast complex esc construct decis list fewer error classif accuraci classif achiev method appear compar exist rule base method empir demonstr rule base method result high classif accuraci categori text assign specif text tend short empir verifi advantag rule base method rule base mine open answer questionnair data text classif esc dbase stochast decis list propos method text classif stochast decis list stochast decis list order sequenc rule method view rule base method text classif advantag readabl refin acquir knowledg method uniqu decis list automat construct basi principl minim extend stochast complex esc construct decis list fewer error classif accuraci classif achiev method appear compar exist rule base method empir demonstr rule base method result high classif accuraci categori text assign specif text tend short empir verifi advantag rule base method rule base learn depend case frame slot address problem automat acquir case frame pattern select pattern larg corpu data propos method learn depend case frame slot view problem learn case frame pattern learn multi dimension discret joint distribut random variabl repres case slot formal depend case slot probabilist depend random variabl nnmber paramet multidimension joint distribut exponenti gener infias accur estim practic overcom difficulti settl approximatiug target joint distribut product low order compon distribut base corpu data propos emploi effici learn algorithm base mdl principl realiz task experiment result class verb accuraci achiev disambigu experi improv acquir knowledg depend word cluster disambigu base doccur data word cluster disambigu base doccurr data address problem cluster word con struct thesauru base occurr data acquir word class improv accuraci syntact disambigu view problem estim joint probabl di tribut joint probabl word pair noun verb pair propos effi cient algorithm base minimum descript length mdl principl estim prob abil distribut method natur tension propos brown al li ab overcom draw back retain advantag coinbin cluster method disam iguat method li ab deriv disambigu method make auto matic construct thesaurus hand made thesauru disambigu accuraci achiev method compar favor accuraci obtain state art disambigu method brill resnik probabilist approach lexic semant knowledg acquisit structur disambigu structur disambigu sentenc analysi central problem natur languag process past research verifi lexic semant knowledg larg extent cope problem studi conduct past address lexic knowledg acquisit problem investig base principl methodolog need fact problem address thesi gener case frame thesauru mdl principl paper confin issu refer interest reader li ab deal issu document classif finit mixtur model propos method classifi document categori defin categori finit mixtur model base soft cluster word treat problem classifi document conduct statist hypothesi test finit mixtur model emploi em algorithm effici estim paramet finit mixtur model exper iment result method outperform exist method document classif finit mixtur model propos method classifi document categori defin categori finit mixtur model base soft cluster word treat problem classifi document conduct statist hypothesi test finit mixtur model emploi em algorithm effici estim paramet finit mixtur model exper iment result method outperform exist method learn depend case frame slot address problem automat acquir case frame pattern select pattern larg corpu data propos method learn depend case frame slot view problem learn case frame pattern learn multi dimension discret joint distribut random variabl repres case slot formal depend case slot probabilist depend random variabl nnmber paramet multidimension joint distribut exponenti gener infias accur estim practic overcom difficulti settl approximatiug target joint distribut product low order compon distribut base corpu data propos emploi effici learn algorithm base mdl principl realiz task experiment result class verb accuraci achiev disambigu experi improv acquir knowledg depend cluster word mdl principl address problcin automat construct thesauru clustertug word base corpu data view problem estim joint distribut cartesian product partit set noun partit set verb propos learu algorithm base minimum descript leugth mdl prin cipl estim empir compar perform method base mdl principl maximum likelihood estim word cluster found outperform evalu method conducttug pp attach disambigu experi automat construct thesauru experim ntal result thesauru improv accuraci disambiguati learn word associ norm tree cut pair model learn depend case frame slot address problem automat acquir case frame pattern select pattern larg corpu data propos method learn depend case frame slot view problem learn case frame pattern learn multi dimension discret joint distribut random variabl repres case slot formal depend case slot probabilist depend random variabl nnmber paramet multidimension joint distribut exponenti gener infias accur estim practic overcom difficulti settl approximatiug target joint distribut product low order compon distribut base corpu data propos emploi effici learn algorithm base mdl principl realiz task experiment result class verb accuraci achiev disambigu experi improv acquir knowledg depend cluster word mdl principl address problcin automat construct thesauru clustertug word base corpu data view problem estim joint distribut cartesian product partit set noun partit set verb propos learu algorithm base minimum descript leugth mdl prin cipl estim empir compar perform method base mdl principl maximum likelihood estim word cluster found outperform evalu method conducttug pp attach disambigu experi automat construct thesauru experim ntal result thesauru improv accuraci disambiguati learn word associ norm tree cut pair model probabilist disambigu method base psycholinguist principl address problem structur disambigu syntact pars psycholinguist number principl disambigu propos notabl lexic prefer rule lpr associ principl rap attach low parallel principl alpp argu order improv disambigu result implement principl basi probabilist methodolog defin word probabl implement lpr length probabl implement rap alpp adopt back method combin type probabl experiment result method effect attain accuraci dline learn binari lexic relat ddimension weight major algorithm dline learn binari lexic relat ddimension weight major algorithm gener case frame thesauru mdl principl paper confin issu refer interest reader li ab deal issu evalu pseudo vector processor base slide dwindow regist present scalar processor high speed vector process evalu propos processor hide long main memori access latenc introduc slide window float point regist data preload featur pipelin memori ow slide window structur propos processor util float point regist keep upward compat exist scalar architectur evalu perform livermor fortran kernel evalu result show propos processor drastic reduc penalti main memori access compar ordinari scalar processor propos processor regist hide memori access latenc cpu cycl throughput main memori byte cycl result conclud propos architectur suitabl high speed vector process introduct motiv past year demand high end supercompu comparison project pursuit neural network regress model 